Voronoi Diagram of a Polygon in chessboard Metric and Maskless lithographic Applications

نویسندگان

  • Hayong Shin
  • Seyoun Park
  • Eonjin Park
  • Deok-Soo Kim
چکیده

Lithography using photomasks has been the major workhorse in printed circuit boards, semiconductors, and flat panel display device manufacturing. However, the cost of photomask is so high that it often becomes the bottleneck, especially when the production volume is low. Recently, maskless lithography technology is gaining more attention, and hence, the computation of efficient lithography path becomes of greater importance than ever in order to obtain high throughput of lithography process. The target machine in mind has a numerically controlled XY table on which a substrate is located and a variable size (square-shape) aperture in front of the light source. In this paper, we present an approach to direct lithography path generation using Voronoi diagram and medial axis transform in chessboard metric. The properties and construction method of Voronoi diagram of a polygonal object in chessboard metric is examined. Then, lithography path generation scheme is explained. The proposed idea can also be applied to the fabrication of photomask itself and the rapid prototyping of a 3D model via layered lithography.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon

Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(n log log n+m logm)time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This i...

متن کامل

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

Given a set of sites in a simple polygon, a geodesic Voronoi diagram partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones form ≤ n/polylogn. Moreover, the algorithms for the ne...

متن کامل

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon

Given a set of sites (points) in a simple polygon, the farthest-point geodesic Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O((n + m) log logn)time algorithm to compute the farthest-point geodesic Voronoi diagram for m sites lying on the boundary of a si...

متن کامل

Generating and updating multiplicatively weighted Voronoi diagrams for point, line and polygon features in GIS

A Voronoi diagram is an interdisciplinary concept that has been applied to many fields. In geographic information systems (GIS), existing capabilities for generating Voronoi diagrams normally focus on ordinary (not weighted) point (not linear or area) features. For better integration of Voronoi diagram models and GIS, a raster-based approach is developed, and implemented seamlessly as an ArcGIS...

متن کامل

Near Pole Polar Diagram of Points and its Duality with Applications

In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Geometry Appl.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2008